package com.demo70_爬楼梯;

/**
 * 递归要比这个 动态规划要省时间吗???
 */
public class Solution_动态规划 {
    public int climbStairs(int n) {
        int[] dp = new int[n+1];
        if (n==1){
            return 1;
        }
        if(n==2){
            return 2;
        }
        dp[1]=1;
        dp[2]=2;
        for (int i = 3; i <= n; i++) {
            dp[i]=dp[i-1]+dp[i-2];
        }

        return dp[n];

    }
}
